Perron eigenvectors and the symmetric transportation polytope
نویسندگان
چکیده
منابع مشابه
Real symmetric matrices 1 Eigenvalues and eigenvectors
A matrix D is diagonal if all its off-diagonal entries are zero. If D is diagonal, then its eigenvalues are the diagonal entries, and the characteristic polynomial of D is fD(x) = ∏i=1(x−dii), where dii is the (i, i) diagonal entry of D. A matrix A is diagonalisable if there is an invertible matrix Q such that QAQ−1 is diagonal. Note that A and QAQ−1 always have the same eigenvalues and the sam...
متن کاملThe Symmetric Traveling Salesman Polytope Revisited
We propose in this paper a tour of the symmetric traveling salesman polytope, focusing on inequalities that can be deened on sets. The most known inequalities are all of this type. Many papers have appeared which give more and more complex valid inequalities for this polytope, but no intuitive idea on why these inequalities are valid has ever been given. In order to help in understanding these ...
متن کاملOn Computing the Eigenvectors of Symmetric Tridiagonal and Semiseparable Matrices
A real symmetric matrix of order n has a full set of orthogonal eigenvectors. The most used approach to compute the spectrum of such matrices reduces first the dense symmetric matrix into a symmetric structured one, i.e., either a tridiagonal matrix [2, 3] or a semiseparable matrix [4]. This step is accomplished in O(n) operations. Once the latter symmetric structured matrix is available, its s...
متن کاملA Quadratic Bound on the Diameter of the Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m× n transportation problem is less than 12 (m + n). The transportation problem ( TP ) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [8] and independently by Koopmans in 1947 [11], and appears in any standard introductory course on op...
متن کاملA Linear Bound On The Diameter Of The Transportation Polytope
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m× n transportation problem is at most 8 (m+ n− 2). The transportation problem (TP ) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [9] and independently by Koopmans in 1947 [12], and appears in any standard introductory course on oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90165-s